Your selections:
Editing graphs to satisfy degree constraints: a parameterized approach
- Mathieson, Luke, Szeider, Stefan
- Fellows, Michael R., Rosamond, Frances A., Rotics, Udi, Szeider, Stefan
Clique width minimization is NP-hard
- Fellows, Michael R., Rosamond, Frances A., Rotics, Udi, Szeider, Stefan
On finding short resolution refutations and small unsatisfiable subsets
- Fellows, Michael R., Szeider, Stefan, Wrightson, Graham
Are you sure you would like to clear your session, including search history and login status?